Offered spring. Prereq., one of M 162, M 172 or M 182 (M 221 or M 225 recommended). Intended for non?mathematics majors as well as mathematics majors. Introduction to discrete optimization and modeling techniques with applications. Topics from combinatorics and graph theory, including enumeration, graph algorithms, matching problems and networks.